Computability theory - PDFSEARCH.IO - Document Search Engine

Computability theory
Results: 1231

#	Item
141	A LIGHTFACE ANALYSIS OF THE DIFFERENTIABILITY RANK LINDA BROWN WESTRICK Abstract. We examine the computable part of the differentiability hierarchy defined by Kechris and Woodin. In that hierarchy, the rank of a differen Add to Reading List Source URL: www.math.uconn.edu Language: English - Date: 2014-10-24 11:30:43 Ordinal numbers Proof theory Computability theory Mathematical notation Ordinal notation Continuous function Constructible universe Limit of a function Symbol NC Computable number Fast-growing hierarchy
142	Effective bounds from ineffective proofs in analysis: an application of functional interpretation and majorization∗ Ulrich Kohlenbach Fachbereich Mathematik, J.W.Goethe–Universitt Robert–Mayer–Str. 6–10, 6000 F Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Language: English - Date: 2014-04-08 11:54:42 Computability theory Mathematical logic Logic Primitive recursive functional Proof theory Symbol Mathematics Table of stars with Bayer designations
143	RAMSEY’S THEOREM FOR SINGLETONS AND STRONG COMPUTABLE REDUCIBILITY DAMIR D. DZHAFAROV, LUDOVIC PATEY, REED SOLOMON, AND LINDA BROWN WESTRICK Abstract. We answer a question posed by Hirschfeldt and Jockusch by showing Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2016-05-31 11:43:35 Mathematics Mathematical analysis Differential forms Constructible universe Closed and exact differential forms Computability theory Combinatory logic Ordinal number Differential forms on a Riemann surface Banach fixed-point theorem
144	On uniform weak K¨onig’s lemma Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Language: English - Date: 2012-11-16 09:11:16 Computability theory Proof theory Mathematical logic Predicate logic Logic in computer science Primitive recursive functional Reverse mathematics Primitive recursive function Primitive recursive arithmetic First-order logic Peano axioms Ordinal analysis
145	OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2015-10-26 09:24:01 Computability theory Mathematical logic Proof theory Theory of computation Logic in computer science Computable function Reverse mathematics PA degree Peano axioms
146	THE WEAKNESS OF BEING COHESIVE, THIN OR FREE IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this pape Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2016-02-08 07:56:59 Computability theory Computable function Computation in the limit Second-order arithmetic Compactness theorem Reverse mathematics 01 class PA degree Low Algorithmically random sequence Computable number
147	Things that can and things that can’t be done in PRA Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade, Bldg. 540 Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Language: English - Date: 2012-11-16 09:11:59 Computability theory Mathematical logic Mathematics Theoretical computer science Primitive recursive function Primitive recursive arithmetic ELEMENTARY Reverse mathematics Pairing function Ackermann function Sequence Recursion
148	Towards a Theory of Peer-to-Peer Computability Joachim Giesen Roger Wattenhofer Aaron Zollinger {giesen,wattenhofer,zollinger}@inf.ethz.ch Department of Computer Science, ETH Zurich, 8092 Zurich, Switzerland Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:32 Graph theory Complex systems theory Graph Directed acyclic graph Peer-to-peer Tree Social peer-to-peer processes Consensus
149	Ramsey-type graph coloring and diagonal non-computability Ludovic Patey Abstract A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions pla Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2015-01-27 11:28:33 Computability theory Theory of computation Mathematics Theoretical computer science Mathematical analysis Computable function Sigma-algebra Generalised Whitehead product
150	Classical provability of uniform versions and intuitionistic provability Makoto Fujiwara∗ Mathematical Institute Tohoku University 6-3, Aramaki Aoba, Aoba-ku Sendai, Miyagi, Japan Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Language: English - Date: 2013-08-17 07:52:06 Computability theory Proof theory Mathematical logic Logic Reverse mathematics Mathematics Philosophy of mathematics

UPDATE